The square-Newton iteration for linear complementarity problem
نویسندگان
چکیده
For getting the numerical solution of linear complementary problem (LCP), there are many methods such as modulus-based matrix splitting iteration and nonsmooth Newton?s method. We proposed Square-Newton method to solve LCP. This could LCP efficiently. gave theoretical analysis experiments in paper.
منابع مشابه
A least-square semismooth Newton method for the second-order cone complementarity problem
We present a nonlinear least-square formulation for the second-order cone complementarity problem based on the Fischer-Burmeister (FB) function and the plus function. The formulation has twofold advantages. Firstly, the operator involved in the overdetermined system of equations inherits the favorable properties of the FB function for local convergence, for example, the (strong) semismoothness....
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملA Damped Guass-Newton Method for the Generalized Linear Complementarity Problem
In this paper, we consider the generalized linear complementarity problem (GLCP) over an affine subspace. To this end, we first reformulate the GLCP as a system of nonsmooth equation via the Fischer function. Based on this reformulation, the famous damped Gauss-Newton (DGN) algorithm is employed for obtaining its solution, and we show that the DGN algorithm is quadratically convergent without n...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2023
ISSN: ['2406-0933', '0354-5180']
DOI: https://doi.org/10.2298/fil2302467f